package com.cris.sorting;

/**
 * Created by owen on 2017/3/1.
 */
public class Selection {
    public static void sort(Comparable[] a){
        for (int i = 0; i < a.length; i++) {
            int min = i;
            for (int j = i+1; j < a.length; j++) {
                if (less(a[j],a[min])) min = j;
            }
            exch(a,i,min);
        }
        }



    //return true if v<w,else return false
    private static boolean less(Comparable v,Comparable w){
        return v.compareTo(w)<0;
    }
    private static void exch(Comparable []a,int i,int j){
        Comparable t = a[i]; a[i] = a[j]; a[j]=t;
    }
    private static void show(Comparable []a){
        for (int i=0;i<a.length;i++){
            System.out.print(a[i]+"");
        }
    }
    public static boolean isSorted(Comparable []a){
        for(int i = 1;i<a.length;i++){
            if(less(a[i],a[i-1])) return false;
        }
        return true;
    }

    public static void main(String[] args) {
        Double[] a = {} ;
         sort(a);
        System.out.println(isSorted(a));
        show(a);
    }

}
